Moments of Uniform Random Multigraphs with Fixed Degree Sequences
نویسندگان
چکیده
منابع مشابه
Degree sequences of multigraphs
Let a, b and n be integers, n ≥ 1 and b ≥ a ≥ 0. Let an (a, b, n)-graph defined as a loopless graph G(a, b, n) on n vertices {V1, . . . , Vn}, in which Vi and Vj are connected with at least a and at most b (directed or undirected) edges. If G(a, b, n) is directed, then it is called (a, b, n)-digraph and if it is undirected, then it is called (a, b, n)undigraph. Landau in 1953 published an algor...
متن کاملUniform generation of random graphs with power-law degree sequences
We give a linear-time algorithm that approximately uniformly generates a randomsimple graph with a power-law degree sequence whose exponent is at least 2.8811.While sampling graphs with power-law degree sequence of exponent at least 3 is fairlyeasy, and many samplers work efficiently in this case, the problem becomes dramaticallymore difficult when the exponent drops below 3; ou...
متن کاملConfiguring Random Graph Models with Fixed Degree Sequences
Random graph null models have found widespread application in diverse research communities analyzing network datasets, including social, information, and economic networks, as well as food webs, protein-protein interactions, and neuronal networks. The most popular family of random graph null models, called configuration models, are defined as uniform distributions over a space of graphs with a ...
متن کاملLink and subgraph likelihoods in random undirected networks with fixed and partially fixed degree sequences.
The simplest null models for networks, used to distinguish significant features of a particular network from a priori expected features, are random ensembles with the degree sequence fixed by the specific network of interest. These "fixed degree sequence" (FDS) ensembles are, however, famously resistant to analytic attack. In this paper we introduce ensembles with partially-fixed degree sequenc...
متن کاملEnumeration of the Degree Sequences of Line–hamiltonian Multigraphs
Recently, Gu, Lai and Liang proved necessary and sufficient conditions for a given sequence of positive integers d1, d2, . . . , dn to be the degree sequence of a line– Hamiltonian multigraph. Our goal in this note is to utilize this result to prove a closed formula for the function dlh(2m), the number of degree sequences with degree sum 2m representable by line–Hamiltonian multigraphs. Indeed,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Mathematics of Data Science
سال: 2020
ISSN: 2577-0187
DOI: 10.1137/19m1288772